An Improved Approximation for Packing Big Two-Bar Charts
نویسندگان
چکیده
We consider the two-bar charts packing problem which is a generalization of strongly NP-hard bin and 2-D vector problem. propose an O(n2.5)-time 16/11-approximation algorithm for when at least one bar each chart has height more than 1/2 5/4-approximation nonincreasing or nondecreasing higher 1/2.
منابع مشابه
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of minimal height, respectively. All packings have to be non-overlapping and orthogonal, i.e., axisparallel. Our algorithm for strip packing has an absolute approximation ratio of 1.9396 and is the first algorithm to break the ap...
متن کاملImproved Approximation Algorithm for Two-Dimensional Bin Packing
We study the two-dimensional bin packing problem with and without rotations. Here we are given a set of two-dimensional rectangular items I and the goal is to pack these into a minimum number of unit square bins. We consider the orthogonal packing case where the edges of the items must be aligned parallel to the edges of the bin. Our main result is a 1.405approximation for two-dimensional bin p...
متن کاملAn Improved Big Bang-Big Crunch Algorithm for Estimating Three-Phase Induction Motors Efficiency
Nowadays, the most generated electrical energy is consumed by three-phase induction motors. Thus, in order to carry out preventive measurements and maintenances and eventually employing high-efficiency motors, the efficiency evaluation of induction motors is vital. In this paper, a novel and efficient method based on Improved Big Bang-Big Crunch (I-BB-BC) Algorithm is presented for efficiency e...
متن کاملAn Improved Randomized Approximation Algorithm for Maximum Triangle Packing
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expected ratio of 43 83 (1− ) (≈ 0.518(1− )) for any constant > 0. By modifying their algorithm, we obtain a new randomized polynomial-time approximation algorithm for the problem which achieves an expected ratio of 0.5257...
متن کاملImproved Approximation for Vector Bin Packing
We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing arising in resource allocation and scheduling problems. Here we are given a set of d-dimensional vectors v1, . . . , vn in [0, 1] , and the goal is to pack them into the least number of bins so that for each bin B, the sum of the vectors in it is at most 1 in every dimension, i.e., || ∑ vi∈B vi||...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2022
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-022-06151-w